package 字节;

import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;

/**
 * @author zhangmin
 * @create 2022-03-27 19:28
 * 4、广度优先遍历，用队列记录遍历，然后记录遍历过的节点，当所有节点都被遍历过则结束
 */
public class zijei_0327_1 {
    public static void main(String[] args) {
        Scanner cin=new Scanner(System.in);
        int n=cin.nextInt();
        List<int[]>[] graph=new LinkedList[n+1];

        for (int i = 0; i < n; i++) {
            graph[i]=new LinkedList<>();

        }
    }
}
